Solution algorithms for the generalized train unit shunting problem

This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). is pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: Matching Problem, Track Assignment Routing Maintenance Problem. In our algorithms, we consider combinations for integrated or sequential solutions these sub-problems, typically considered independently literature. We assess performance proposed real-life fictive instances representing traffic Metz-Ville which shunting yards. main junction two dense lines east France. thorough experimental analysis, study contribution each sub-problem difficulty G-TUSP, identify best algorithms. The outcomes are superior manually designed by experienced railway practitioners.